On an interpolation property of outerplanar graphs
نویسندگان
چکیده
LetD be an acyclic orientation of a graphG.An arc ofD is said to be dependent if its reversal creates a directed cycle. Let d(D) denote the number of dependent arcs inD. Define dmin(G) (dmax(G)) to be theminimum (maximum) number of d(D) over all acyclic orientationsD ofG.We determine dmin(G) for an outerplanar graph G and prove that G has an acyclic orientation with exactly k dependent arcs if dmin(G) k dmax(G). © 2005 Elsevier B.V. All rights reserved.
منابع مشابه
Every Property of Outerplanar Graphs is Testable
A D-disc around a vertex v of a graph G = (V,E) is the subgraph induced by all vertices of distance at most D from v. We show that the structure of an outerplanar graph on n vertices is determined, up to modification (insertion or deletion) of at most n edges, by a set of D-discs around the vertices, for D = D( ) that is independent of the size of the graph. Such a result was already known for ...
متن کاملStructure And Properties Of Locally Outerplanar Graphs
This paper studies convex geometric graphs in which no path of length 3 self-intersects. A main result gives a decomposition of such graphs into induced outerplanar graph drawings. The resulting structure theorem is then used to compute a sharp, linear upper bound on the size of the edge set in terms of the number of vertices and the number and type of graphs in the decomposition. The paper als...
متن کاملA Note on the Structure of Locally Outerplanar Graphs
A convex geometric graph is called locally outerplanar if there is no path of length three intersects itself. In [D. Boutin, Convex Geometric Graphs with No Short Self-intersecting Path, Congressus Numerantium 160 (2003) 205–214.] and [D. Boutin, Structure and Properties of Locally Outerplanar Graphs, Journal of Combinatorial Mathematics and Combinatorial Computing 60 (2007) 169–180.], Boutin s...
متن کاملOn partitions of hereditary properties of graphs
In this paper a concept Q-Ramsey Class of graphs is introduced, where Q is a class of bipartite graphs. It is a generalization of wellknown concept of Ramsey Class of graphs. Some Q-Ramsey Classes of graphs are presented (Theorem 1 and 2). We proved that T 2, the class of all outerplanar graphs, is not D1-Ramsey Class (Theorem 3). This results leads us to the concept of acyclic reducible bounds...
متن کاملThe Number of Spanning Trees of an Infinite Family of Outerplanar, Small-World and Self-Similar Graphs
In this paper we give an exact analytical expression for the number of spanning trees of an infinite family of outerplanar, small-world and self-similar graphs. This number is an important graph invariant related to different topological and dynamic properties of the graph, such as its reliability, synchronization capability and diffusion properties. The calculation of the number of spanning tr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Applied Mathematics
دوره 154 شماره
صفحات -
تاریخ انتشار 2006